Interaction Grammars Interaction Grammars
نویسندگان
چکیده
Interaction Grammar (IG) is a grammatical formalism based on the notion of polarity. Polarities express the resource sensitivity of natural languages by modelling the distinction between saturated and unsaturated syntactic structures. Syntactic composition is represented as a chemical reaction guided by the saturation of polarities. It is expressed in a model-theoretic framework where grammars are constraint systems using the notion of tree description and parsing appears as a process of building tree description models satisfying criteria of saturation and minimality. Key-words: Grammatical formalism, Categorial Grammar, Unification, Polarity, Tree description ∗ LORIA, INRIA Nancy Grand-Est ([email protected]) † LORIA, Université Nancy 2 ([email protected]) in ria -0 02 88 37 6, v er si on 2 2 Se p 20 08 Les Grammaires d’Interaction Résumé : Les grammaires d’interaction sont un formalisme grammatical basé sur la notion de polarité. Les polarités expriment la sensibilité aux ressources de la langue naturelle en distinguant les structures syntaxiques saturées et insaturées. La composition syntaxique peut être vue comme une réaction chimique controlée par la saturation des polarités. Les grammaires sont exprimées par un système de contraintes utilisant la notion de description d’arbre. L’analyse syntaxique apparâit alors comme un processus de construction de modèles satisfaisant des critères de neutralité et de minimalité. Mots-clés : Formalisme grammatical, Grammaires catégorielles, Polarité, Description d’arbre in ria -0 02 88 37 6, v er si on 2 2 Se p 20 08 Interaction Grammars 3
منابع مشابه
Basic Classes of Grammars with Prohibition
A practical tool for natural language modeling and development of human-machine interaction is developed in the context of formal grammars and languages. A new type of formal grammars, called grammars with prohibition, is introduced. Grammars with prohibition provide more powerful tools for natural language generation and better describe processes of language learning than the conventional form...
متن کاملFrom intuitionistic proof nets to Interaction Grammars
From Intuitionistic Proof Nets to Interaction Grammars
متن کاملLambek Grammars, Tree Adjoining Grammars and Hyperedge Replacement Grammars
Two recent extension of the nonassociative Lambek calculus, the LambekGrishin calculus and the multimodal Lambek calculus, are shown to generate class of languages as tree adjoining grammars, using (tree generating) hyperedge replacement grammars as an intermediate step. As a consequence both extensions are mildly context-sensitive formalisms and benefit from polynomial parsing algorithms.
متن کاملaspects of multimodal categorial grammars
Logical and linguistic aspects of multimodal categorial grammars
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملPattern Grammars in Formal Representations of Musical Structures
This paper introduces several formal models of pattern representation in music. Polyvalent multimodal grammars describe partially overlapping sound events as found in polyphonic structures. Bol Processor grammars are characterizations of sequential events in terms of substring repetitions, homomorphisms, etc. Parsing techniques, stochastic production and recent developments of BP grammars are b...
متن کامل